The Coupon Collector’s Problem
نویسندگان
چکیده
In this note we will consider the following problem: how many coupons we have to purchase (on average) to complete a collection. This problem, which takes everybody back to his childhood when this was really “a problem”, has been considered by the probabilists since the eighteenth century and nowadays it is still possible to derive some new results, probably original or at least never published. We will present some classic results, some new formulas, some alternative approaches to obtain known results and a couple of amazing expressions.
منابع مشابه
Coupon Collecting with Quotas
We analyze a variant of the coupon collector’s problem, in which the probabilities of obtaining coupons and the numbers of coupons in a collection may be non-uniform. We obtain a finite expression for the generating function of the probabilities to complete a collection and show how this generalizes several previous results about the coupon collector’s problem. Also, we provide applications abo...
متن کاملCoupon collector’s problems with statistical applications to rankings
Some new exact distributions on coupon collector’s waiting time problems are given based on a generalized Pólya urn sampling. In particular, usual Pólya urn sampling generates an exchangeable random sequence. In this case, an alternative derivation of the distribution is also obtained from de Finetti’s theorem. In coupon collector’s waiting time problems with m kinds of coupons, the observed or...
متن کاملPoisson Approximation in a Poisson Limit Theorem Inspired by Coupon Collecting
In this paper we refine a Poisson limit theorem of Gnedenko and Kolmogorov (1954): we determine the error order of a Poisson approximation for sums of asymptotically negligible integer-valued random variables that converge in distribution to the Poisson law. As an application of our results, we investigate the case of the coupon collector’s problem when the distribution of the collector’s waiti...
متن کاملThe Collector’s Brotherhood Problem Using the Newman-Shepp Symbolic Method
Further computations are made on the traditional coupon collector’s problem when the collector shares his harvest with his younger brothers. When the book of the p-th brother of the collector is completed, the books of the younger brothers have certain numbers of empty spots. On the average, how many? Several answers can be brought to that question.
متن کاملSome New Aspects of the Coupon Collector's Problem
We extend the classical coupon collector’s problem to one in which two collectors are simultaneously and independently seeking collections of d coupons. We find, in finite terms, the probability that the two collectors finish at the same trial, and we find, using the methods of Gessel-Viennot, the probability that the game has the following “ballotlike” character: the two collectors are tied wi...
متن کاملCoupon Collecting
We consider the classical coupon collector’s problem in which each new coupon collected is type i with probability pi; P i1⁄41 n pi1⁄41. We derive some formulas concerning N, the number of coupons needed to have a complete set of at least one of each type, that are computationally useful when n is not too large. We also present efficient simulation procedures for determining P(N . k), as well a...
متن کامل